Timed Lossy Channel Systems
نویسندگان
چکیده
Lossy channel systems are a classical model with applications ranging from the modeling of communication protocols to programs running on weak memory models. All existing work assume that messages traveling inside the channels are picked from a finite alphabet. In this paper, we extend the model by assuming that each message is equipped with a clock representing the age of the message, thus obtaining the model of Timed Lossy Channel Systems (TLCS). The main contribution of the paper is to show that the control state reachability problem is decidable for TLCS. 1998 ACM Subject Classification D.2.4 Software/Program Verification
منابع مشابه
Well (and better) quasi-ordered transition systems
In this paper, we give a step by step introduction to the theory of well quasi-ordered transition systems. The framework combines two concepts, namely (i) transition systems which are monotonic wrt. a well-quasi ordering; and (ii) a scheme for symbolic backward reachability analysis. We describe several models with infinitestate spaces, which can be analyzed within the framework, e.g., Petri ne...
متن کاملVerifying Networks of Timed Processes
Over the last years there has been an increasing research eeort directed towards the automatic veriication of innnite state systems, such as timed automata, hybrid automata, data-independent systems, rela-tional automata, Petri nets, and lossy channel systems. We present a method for deciding reachability properties of networks of timed processes. Such a network consists of an arbitrary set of ...
متن کاملModel Checking of Systems withMany
Over the last years there has been an increasing research eeort directed towards the automatic veriication of innnite state systems, such as timed automata, hybrid automata, data-independent systems, relational automata, Petri nets, lossy channel systems, context-free and push-down processes. We present a method for deciding reach-ability properties of networks of timed processes. Such a networ...
متن کاملController Synthesis for MTL Specifications
We consider the control problem for timed automata against specifications given as MTL formulas. The logic MTL is a linear-time timed temporal logic which extends LTL with timing constraints on modalities, and recently, its model-checking has been proved decidable in several cases. We investigate these decidable fragments of MTL (full MTL when interpreted over finite timed words, and Safety-MTL...
متن کاملDecidability of Simulation and Bisimulation between Lossy Channel Systems and Finite State Systems (Extended Abstract)
We consider the veriication of a class of innnite-state systems called lossy channel systems, which consist of nite-state processes communicating via unbounded but lossy FIFO channels. This class is able to model several interesting protocols, such as HDLC, the Alternating Bit Protocol, and other Sliding Window protocols. In earlier papers we have considered the decidability of various temporal...
متن کامل